A Recursive Construction of Permutation Polynomials over $\mathbb{F}_{q^2}$ with Odd Characteristic from R\'{e}dei Functions
نویسندگان
چکیده
In this paper, we construct two classes of permutation polynomials over Fq2 with odd characteristic from rational Rédei functions. A complete characterization of their compositional inverses is also given. These permutation polynomials can be generated recursively. As a consequence, we can generate recursively permutation polynomials with arbitrary number of terms. More importantly, the conditions of these polynomials being permutations are very easy to characterize. For wide applications in practice, several classes of permutation binomials and trinomials are given. With the help of a computer, we find that the number of permutation polynomials of these types is very large.
منابع مشابه
On Codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over $R$. Further, we give bounds on the minimum distance of LCD codes over $\F_q$ and extend these to codes ove...
متن کاملSkew cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
In this article, we study skew cyclic codes over ring R = Fq + vFq + v 2 Fq, where q = p, p is an odd prime and v3 = v. We describe generator polynomials of skew cyclic codes over this ring and investigate the structural properties of skew cyclic codes over R by a decomposition theorem. We also describe the generator polynomials of the duals of skew cyclic codes. Moreover, the idempotent genera...
متن کاملSeveral Classes of Permutation Trinomials over $\mathbb F_{5^n}$ From Niho Exponents
The construction of permutation trinomials over finite fields attracts people’s interest recently due to their simple form and some additional properties. Motivated by some results on the construction of permutation trinomials with Niho exponents, by constructing some new fractional polynomials that permute the set of the (q + 1)-th roots of unity in Fq2 , we present several classes of permutat...
متن کاملNew Constructions of Permutation Polynomials of the Form $x^rh\left(x^{q-1}\right)$ over $\mathbb{F}_{q^2}$
Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form xh ( x ) over Fq2 , where q = 2 , h(x) = 1+x+x and r, s, t, k > 0 are integers. Their methods are essentially usage of a multiplicative versio...
متن کاملFive Constructions of Permutation Polynomials over $\gf(q^2)$
Four recursive constructions of permutation polynomials over GF(q2) with those over GF(q) are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over GF(q2 l ) for any positive integer l with any given permutation polynomial over GF(q). A generic construction of permutation polynomials over GF(22m) with o-polynomial...
متن کامل